Consistency of modularity clustering on random geometric graphs
نویسندگان
چکیده
منابع مشابه
Advanced Cost based Graph Clustering Algorithm for Random Geometric Graphs
There is an increasing interest in the research of clustering or finding communities in complex networks. Graph clustering and graph partitioning algorithms have been applied to this problem. Several graph clustering methods are come into the field but problem lies in the model espoused by the state-of-the-art graph clustering algorithms for solving real-world situation. In this work, an attemp...
متن کاملModularity-Driven Clustering of Dynamic Graphs
Abstract. Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but evolve over time, traditional static approaches can be inappropriate for specific tasks. In this work we pioneer the NP-hard problem of online dynamic modularity maximization. We develop scalable dynamization...
متن کاملOn the Distribution of Random Geometric Graphs
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random topology, properties (e.g., connectedness), or Shannon entropy as a measure of the graph’s topological uncertainty (or information content). Moreover, the distributi...
متن کاملInfinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملDynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2018
ISSN: 1050-5164
DOI: 10.1214/17-aap1313